Multipath Adaptive Tabu Search for a Vehicle Control Problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multipath Adaptive Tabu Search for a Vehicle Control Problem

1 Control and Automation Research Unit, Power Electronics, Machines, and Control Research Group, School of Electrical Engineering, Suranaree University of Technology, Nakhon Ratchasima 30000, Thailand 2 Department of Electrical Engineering, Rajamangala University of Technology Lanna Tak, Tak 63000, Thailand 3 Department of Electrical Engineering, South-East Asia University, Bangkok 10160, Thailand

متن کامل

A tabu search algorithm for the vehicle routing problem

The purpose of this study is to develop a new tabu seach heuristic to solve the single-depot vehicle routing problem of a distribution company carrying goods from a depot to a set of dedicated dealers. The heuristic proposes a new neighbourhood generation procedure which considers the scattering pattern in the locations of the dealers. A set of neighbours are generated by first executing a proc...

متن کامل

Tabu Search Heuristics for the Vehicle Routing Problem

This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first described: neighbourhood structures, short term memory, long term memory, intensification. The tabu search algorithms are then described, followed by computational results and the conclusion.

متن کامل

Tabu Search for a Car Sequencing Problem

The goal of this paper is to propose a tabu search heuristic for the car sequencing problem (CSP) used for the ROADEF 2005 international Challenge. This NP-hard problem was proposed by the automobile manufacturer Renault. The first objective of the car industry is to assign a production day to each customer-ordered car and the second one consists of scheduling the order of cars to be put on the...

متن کامل

APPLICATION OF TABU SEARCH FOR SOLVING THE BI-OBJECTIVE WAREHOUSE PROBLEM IN A FUZZY ENVIRONMENT

The bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. To deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. We describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Mathematics

سال: 2012

ISSN: 1110-757X,1687-0042

DOI: 10.1155/2012/731623